Complexity Analysis of Tree Share Structure
نویسندگان
چکیده
We investigate the complexity of the tree share model of Dockins et al., which is used to reason about shared ownership of resources in concurrent programs. We obtain the precise Berman complexity for the first-order theory of the Boolean algebra of tree shares with constants, which is STA(∗, 2 O(1) , n)-complete. For the first-order theory over the “relativization” multiplication operator on trees if one operand is a constant, we show that it is STA(∗, 2, n)-complete. Finally, we prove that the first-order theory of the combined structure between Boolean algebra operators and the right-handed multiplication is non-elementary.
منابع مشابه
An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملHow to infinitely share a secret more efficiently
We device a general secret sharing scheme for evolving access structures (following [KNY16]). Our scheme has (sub)exponentially smaller share complexity (share of i’th party) for certain access structures compared to the general scheme in [5]. We stress that unlike [5]’s scheme, our scheme requires that the entire evolving access structure is known in advance. Revising, [5]’s scheme (in its mos...
متن کاملA method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time
In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...
متن کاملComplexity Analysis of Tree Share Operations
We investigate the complexity of the tree share model of Dockins et al., which is used to reason about shared ownership of resources in e.g. concurrent programs. We obtain the precise complexity for first-order theory of the full Boolean algebra of tree shares (that is, with all tree-share constants) which is the same as first-order theory of countably atomless Boolean algebras (that is, where ...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017